Convergence of Zeta Functions of Graphs

نویسندگان

  • BRYAN CLAIR
  • SHAHRIAR MOKHTARI-SHARGHI
چکیده

The L-zeta function of an infinite graph Y (defined previously in a ball around zero) has an analytic extension. For a tower of finite graphs covered by Y , the normalized zeta functions of the finite graphs converge to the L-zeta function of Y . Introduction Associated to any finite graph X there is a zeta function Z(X,u), u ∈ C. It is defined as an infinite product but shown (in various different cases) by Ihara, Hashimoto, and Bass [5, 4, 1] to be a polynomial. Indeed the rationality formula for a q + 1 regular X states that: Z(X,u) = (1− u2)−χ(X) Det(I − δu+ qu). (0.1) Here δ is the adjacency operator of X . In [2], an L-zeta function is defined for noncompact graphs with symmetries, using the machinery of von Neumann algebras. A rationality formula similar to (0.1) expresses the relationship between the zeta function and the von Neumann determinant of a Laplace operator. The results of this paper focus on an especial case. Let Y be an infinite graph which covers a finite graph B = π\Y . The L-zeta function Zπ(Y, u) is defined in [2] only in a small neighborhood of zero. The first result of this paper is to extend the L-zeta function to the interior of C = {u ∈ C : |u| = q−1/2} ∪ [−1,− 1 q ] ∪ [ 1 q , 1]. In the second part of the paper, we consider a tower of finite graphs Bi covered by Y . Put Ni = |Bi|/|B|. In Theorem 2.1 we show that the zeta functions for the Bi, renormalized by taking N th i roots, converge to the L -zeta function for Y . The argument is inspired by, and uses, work of Lück [7]. Date: July 14, 2000. 1 2 BRYAN CLAIR AND SHAHRIAR MOKHTARI-SHARGHI In the first section we recall the definitions of the zeta functions of finite and infinite graphs. One of the main results of this paper is Theorem 1.5 in this section. In the second section of this paper we prove the convergence theorem and exhibit interesting examples. Theorem 2.4 generalizes work of Deitmar [3]. 1. Zeta functions In this section we recall the definition of the zeta function and related material. We first recall the definition of the zeta function for finite graphs. 1.1. Finite Graphs. For a graph X , let V X and EX denote the sets of vertices and edges, respectively, of X . If each vertex has the same degree then X is regular. Definition 1.1. Let X be a finite graph. A closed path in X is primitive if it is not a nontrivial power of another path inside the fundamental group of X . Let P be the set of free homoptopy classes of primitive closed paths of X . Then the zeta function of X is

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

What are zeta functions of graphs and what are they good for ? Matthew

We discuss zeta functions of finite irregular undirected connected graphs (which may be weighted) and apply them to obtain, for example an analog of the prime number theorem for cycles in graphs. We consider 3 types of zeta functions of graphs: vertex, edge, and path. Analogs of the Riemann hypothesis are also introduced.

متن کامل

Zeta Functions of Finite Graphs and Coverings, Iii

A graph theoretical analogue of Brauer-Siegel theory for zeta functions of number …elds is developed using the theory of Artin L-functions for Galois coverings of graphs from parts I and II. In the process, we discuss possible versions of the Riemann hypothesis for the Ihara zeta function of an irregular graph.

متن کامل

An Infinite Family of Graphs with the Same Ihara Zeta Function

In 2009, Cooper presented an infinite family of pairs of graphs which were conjectured to have the same Ihara zeta function. We give a proof of this result by using generating functions to establish a one-to-one correspondence between cycles of the same length without backtracking or tails in the graphs Cooper proposed. Our method is flexible enough that we are able to generalize Cooper’s graph...

متن کامل

The Ihara zeta function for graphs and 3-adic convergence of the Sierpiński gasket

Imagine you were going for a run downtown. You have a set distance you want to go, but you don’t like running the same path two days in a row. You don’t like stopping to turn around and take the same road since this breaks your stride, and just repeating some loop multiple times makes you bored. So, how many options do you have? This situation could be modeled with graph theory, where each inte...

متن کامل

Spectral zeta functions of graphs and the Riemann zeta function in the critical strip

We initiate the study of spectral zeta functions ⇣X for finite and infinite graphs X, instead of the Ihara zeta function, with a perspective towards zeta functions from number theory and connections to hypergeometric functions. The Riemann hypothesis is shown to be equivalent to an approximate functional equation of graph zeta functions. The latter holds at all points where Riemann’s zeta funct...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002